Hat Guessing on Books and Windmills
نویسندگان
چکیده
The hat-guessing number is a graph invariant defined by Butler, Hajiaghayi, Kleinberg, and Leighton. We determine the exactly for book graphs with sufficiently many pages, improving previously known lower bounds of He Li matching an upper bound Gadouleau. prove that $K_{3,3}$ $3$, making this first complete bipartite $K_{n,n}$ which to be smaller than $n+1$ Gadouleau Georgiou. Finally, we windmill most choices parameters.
منابع مشابه
Hat Guessing Games
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking at the colors of the hats worn by some of the other players. In this paper we consider several variants of the problem, united by the common theme that the guessing strategies are required to be deterministic and the ob...
متن کاملWinkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions
In this note, we give an explicit polynomial-time executable strategy for Peter Winkler’s hat guessing game that gives superior results if the distribution of hats is imbalanced. While Winkler’s strategy guarantees in any case that ⌊n/2⌋ of the n player guess their hat color correct, our strategy ensures that the players produce max{r, b} − 1.2n2/3 − 2 correct guesses for any distribution of r ...
متن کاملThe Three Colour Hat Guessing Game on Cycle Graphs
We study a cooperative game in which each member of a team of N players, wearing coloured hats and situated at the vertices of the cycle graph CN , is guessing their own hat colour merely on the basis of observing the hats worn by their two neighbours without exchanging the information. Each hat can have one of three colours. A predetermined guessing strategy is winning if it guarantees at leas...
متن کاملA New Variation of Hat Guessing Games
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of n players is assigned a hat from a given color set. Simultaneously, each player tries to guess the color of his/her own hat by looking at colors of hats worn by other players. In this paper, we consider a new variati...
متن کاملWindmills and Extreme 2-cells
In this article we prove new results about the existence of 2-cells in disc diagrams which are extreme in the sense that they are attached to the rest of the diagram along a small connected portion of their boundary cycle. In particular, we establish conditions on a 2-complex X which imply that all minimal area disc diagrams over X with reduced boundary cycles have extreme 2-cells in this sense...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2022
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10098